Biclique communities
نویسندگان
چکیده
منابع مشابه
Biclique communities.
We present a method for detecting communities in bipartite networks. Based on an extension of the k -clique community detection algorithm, we demonstrate how modular structure in bipartite networks presents itself as overlapping bicliques. If bipartite information is available, the biclique community detection algorithm retains all of the advantages of the k -clique algorithm, but avoids discar...
متن کاملBiclique graphs and biclique matrices
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1,−1} matrix having one row for each biclique and one column for each vertex of G, and such that a pair of 1, −1 entries in a same row corresponds exactly to adjacent vertices in the corresponding biclique. We describe a characterization of biclique matrices, in simil...
متن کاملBiclique-colouring verification complexity and biclique-colouring power graphs
Biclique-colouring is a colouring of the vertices of a graph in such a way that no maximal complete bipartite subgraph with at least one edge is monochromatic. We show that it is coNP-complete to check whether a given function that associates a colour to each vertex is a bicliquecolouring, a result that justifies the search for structured classes where the biclique-colouring problem could be ef...
متن کاملHereditary biclique-Helly graphs: recognition and maximal biclique enumeration
A biclique is a set of vertices that induce a bipartite complete graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of G is also biclique-Helly, then G is hereditary biclique-Helly. A graph is C4-dominated when every cycle of length 4 contains a vertex that is dominated by the vertex of the cycle that is not adjacent t...
متن کاملBiclique-Helly Graphs
A graph is biclique-Helly when its family of (maximal) bicliques is a Helly family. We describe characterizations for biclique-Helly graphs, leading to polynomial time recognition algorithms. In addition, we relate biclique-Helly graphs to the classes of clique-Helly, disk-Helly and neighborhood-Helly graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.78.016108